Request Scheduling in Quantum Networks

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Data Request Scheduling Policy for PCS Networks

20 request blocking probability and the expected waiting time of an accepted data request. Based on an analytic model, several results are observed: When the voice traac to a radio channel is less than 0.3 Erlang, the performance of LPER is not aaected by the voice traac, and the waiting times of the data requests can be ignored. Thus, a large number of voice channels should be shared with the ...

متن کامل

Combining request scheduling with web caching

We extend the classic paging model by allowing reordering of requests under the constraint that a request is delayed by no longer than a predetermined number of time steps. We first give a dynamic programming algorithm to solve the offline case. Then we give tight bounds on competitive ratios for the online case. For caches of size k, we obtain bounds of k + O(1) for deterministic algorithms an...

متن کامل

Request Density Aware Fair Memory Scheduling

With the rapid advances in semiconductor process technology and microarchitecture, the speed gap between the clock cycle time of processor cores and that of memory systems has increased significantly. To solve this problem, memory system should be efficiently managed. In general, since a thread with fewer requests has a large capability to improve the total execution performance by being priori...

متن کامل

Disk Scheduling with Dynamic Request Priorities

High performance servers in client/server distributed systems must manage and multiplex disk I/O resources eeciently and fairly between multiple clients. In digital multimedia systems, clients may make requests of varying urgencies. The traditional approach to this problem thus assigns priorities to disk requests. High priority requests are scheduled rst, with low priority requests served only ...

متن کامل

Request Satisfaction Problem in Synchronous Radio Networks

We study two algorithmical problems inspired from routing constraints in a multihop synchronous radio network. Our objective is to satisfy a given set of communication requests in the following model: nodes send omnidirectional radio transmissions in synchronous slots; during a given slot, a node can receive a message from an adjacent node if and only if no other neighbour is transmitting other...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Quantum Engineering

سال: 2021

ISSN: 2689-1808

DOI: 10.1109/tqe.2021.3090532